The isogeometric Nyström method
نویسندگان
چکیده
منابع مشابه
The Isogeometric Nyström Method
In this paper the isogeometric Nyström method is presented. It’s outstanding features are: it allows the analysis of domains described by many different geometrical mapping methods in computer aided geometric design and it requires only pointwise function evaluations just like isogeometric collocation methods. The analysis of the computational domain is carried out by means of boundary integral...
متن کاملFast Spectral Clustering via the Nyström Method
We propose and analyze a fast spectral clustering algorithm with computational complexity linear in the number of data points that is directly applicable to large-scale datasets. The algorithm combines two powerful techniques in machine learning: spectral clustering algorithms and Nyström methods commonly used to obtain good quality low rank approximations of large matrices. The proposed algori...
متن کاملIncremental kernel PCA and the Nyström method
Incremental versions of batch algorithms are often desired, for increased time efficiency in the streaming data setting, or increased memory efficiency in general. In this paper we present a novel algorithm for incremental kernel PCA, based on rank one updates to the eigendecomposition of the kernel matrix, which is more computationally efficient than comparable existing algorithms. We extend o...
متن کاملSampling Methods for the Nyström Method
The Nyström method is an efficient technique to generate low-rank matrix approximations and is used in several large-scale learning applications. A key aspect of this method is the procedure according to which columns are sampled from the original matrix. In this work, we explore the efficacy of a variety of fixed and adaptive sampling schemes. We also propose a family of ensemble-based samplin...
متن کاملMatrix compression using the Nyström method
The Nyström method is routinely used for out-of-sample extension of kernel matrices. We describe how this method can be applied to find the singular value decomposition (SVD) of general matrices and the eigenvalue decomposition (EVD) of square matrices. We take as an input a matrix M ∈ Rm×n, a user defined integer s ≤ min(m, n) and AM ∈ Rs×s, a matrix sampled from columns and rows of M . These ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2016
ISSN: 0045-7825
DOI: 10.1016/j.cma.2016.03.043